ON APPROXIMATE COUNTINGFLAJOLET P.1983; SEMINAIRE INTERNATIONAL SUR LA MODELISATION ET LES METHODES D'EVALUATION DE PERFORMANCE/1983-01-24/PARIS; FRA; ROCQUENCOURT: INRIA; DA. 1983; 2; PP. 205-235; BIBL. 8 REF.Conference Paper

ANALYSE D'ALGORITHMES DE MANIPULATION D'ARBRES ET DE FICHIERSFLAJOLET P.1981; CAH. BUR. UNIV. RECH. OPER.; ISSN 0078-950X; FRA; DA. 1981; NO 34-35; 209 P.; BIBL. 4 P.Serial Issue

COMBINATORIAL ASPECTS OF CONTINUED FRACTIONSFLAJOLET P.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 32; NO 2; PP. 125-161; BIBL. 33 REF.Article

ANALYSE D'ALGORITHMES DE MANIPULATION DE FICHIERSFLAJOLET P.1978; I.R.I.A., LAB. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1978; NO 321; PP. 1-28; ABS. ENG; BIBL. 2 P.Serial Issue

PERTURBATION DE LA DECLINAISON MAGNETIQUE A LYON PENDANT L'ANNEE 1921-1922.FLAJOLET P.1922; C.R. ACAD. SCI.-FR.SER.D; FRA; 1922, VOL. 175, P. 1429Miscellaneous

COMBINATORIAL ASPECTS OF CONTINUED FRACTIONSFLAJOLET P.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 217-222; BIBL. 7 REF.Article

THE AVERAGE HEIGHT OF BINARY TREES AND OTHER SIMPLE TREESFLAJOLET P; ODLYZKO A.1983; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1983; VOL. 2; PP. 171-213; BIBL. 20 REF.Article

A NOTE ON GRAY CODE AND ODD-EVEN MERGEFLAJOLET P; RAMSHAW L.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 142-158; BIBL. 14 REF.Article

Combinatorial aspects of continued fractionsFLAJOLET, P.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 992-1021, issn 0012-365X, 30 p.Article

On adaptive samplingFLAJOLET, P.Computing (Wien. Print). 1990, Vol 43, Num 4, pp 391-400, issn 0010-485XArticle

ON THE AVERAGE NUMBER OF REGISTERS REQUIRED FOR EVALUATING ARITHMETIC EXPRESSIONS.FLAJOLET P; RAOULT JC.1977; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1977; NO 228; PP. 1-34; ABS. FR.; BIBL. 1 P.Serial Issue

HIERARCHIES DE COMPLEXITE ET REDUCTIONS ENTRE PROBLEMES.FLAJOLET P; STEYAERT JM.1976; ASTERISQUE; FR.; DA. 1976; NO 38-39; PP. 53-72; BIBL. 26 REF.; (JOURN. ALGORITHMIQUES. CONF.; PARIS; 1975)Conference Paper

COMPLEXITY OF CLASSES OF LANGUAGES AND OPERATORS.FLAJOLET P; STEYAERT JM.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 92; PP. 1-13; ABS. FR.; BIBL. 12 REF.Article

Analytic models and ambiguity of context-free languagesFLAJOLET, P.Theoretical computer science. 1987, Vol 49, Num 2-3, pp 283-309, issn 0304-3975Article

Approximate counting: a detailed analysisFLAJOLET, P.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 1, pp 113-134, issn 0006-3835Article

A BRANCHING PROCESS ARISING IN DYNAMIC HASHING, TRIE SEARCHING AND POLYNOMIAL FACTORIZATIONFLAJOLET P; STEYAERT JM.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 239-251; BIBL. 2 P.Conference Paper

A COMPLEXITY CALCULUS FOR CLASSES OF RECURSIVE SEARCH PROGRAMS OVER TREE STRUCTURESFLAJOLET P; STEYAERT JM.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 386-393; BIBL. 17 REF.Conference Paper

Singularity analysis and asymptotics of Bernoulli sumsFLAJOLET, P.Theoretical computer science. 1999, Vol 215, Num 1-2, pp 371-381, issn 0304-3975Article

On the performance evaluation of extendible hashing and Trie searchingFLAJOLET, P.Acta informatica. 1983, Vol 20, Num 4, pp 345-369, issn 0001-5903Article

ON THE ANALYSIS OF THREE-MATCHING ALGORITHMSFLAJOLET P; STEYAERT JM.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 208-219; BIBL. 12 REF.Conference Paper

UNE GENERALISATION DE LA NOTION D'ENSEMBLE IMMUNE.FLAJOLET P; STEYAERT JM.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 1; PP. 37-48; ABS. ANGL.; BIBL. 15 REF.Article

COMPUTING INTEGRATED COSTS OF SEQUENCES OF OPERATIONS WITH APPLICATION TO DICTIONARIESFLAJOLET P; FRANCON J; VUILLEMIN J et al.1979; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1979; NO 346; 13 P.; ABS. FRE; BIBL. 2 P.Serial Issue

TOWARDS ANALYSING SEQUENCES OF OPERATIONS FOR DYNAMIC DATA STRUCTURES, PREMININARY VERSIONFLAJOLET P; FRANCON J; VUILLEMIN J et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 183-195; BIBL. 3 P.Conference Paper

SEQUENCE OF OPERATIONS ANALYSIS FOR DYNAMIC DATA STRUCTURESFLAJOLET P; FRANCON J; VUILLEMIN J et al.1980; J. ALGORITHMS; USA; DA. 1980; VOL. 1; NO 2; PP. 111-141; BIBL. 35 REF.Article

THE NUMBER OF REGISTERS REQUIRED FOR EVALUATING ARITHMETIC EXPRESSIONSFLAJOLET P; RAOULT JC; VUILLEMIN J et al.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 99-125; BIBL. 25 REF.Article